Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1
نویسندگان
چکیده
We describe a comprehensive HOL mechanisation of the theory of ordinal numbers, focusing on the basic arithmetic operations. Mechanised results include the existence of fixpoints such as ε0, the existence of normal forms, and the validation of algorithms used in the ACL2 theorem-proving system.
منابع مشابه
Transfinite Iteration Functionals and Ordinal Arithmetic
Although transfinite iteration functionals have been used in the past to construct ever-larger initial segments of the ordinals ([5],[1]), there appears to be little investigation into the nature of the functionals themselves. In this note, we investigate the relationship between (countable) transfinite iteration and ordinal arithmetic. While there is a nice connection between finite iteration ...
متن کاملOn Transfinite Knuth-Bendix Orders
In this paper we discuss the recently introduced transfinite Knuth-Bendix orders. We prove that any such order with finite subterm coefficients and for a finite signature is equivalent to an order using ordinals below ω, that is, finite sequences of natural numbers of a fixed length. We show that this result does not hold when subterm coefficients are infinite. However, we prove that in this ge...
متن کاملThe Transfinite Action of 1 Tape Turing Machines
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it apparently yields a smoother classification of classes defined by algorithms that halt at limit ordinals. • We consider some relations of such classes with other similar notions, such as arithmetical quasi-inductive definitio...
متن کاملArithmetical quasi - inductive definitions and the transfinite action of 1 tape Turing machines
• We produce a classification of the pointclasses using infinite time turing machines with 1-tape. The reason for choosing this formalism is that it apparently yields a smoother classification of classes defined by algorithms that halt at limit ordinals. • We consider some relations of such classes with other similar notions, such as arithmetical quasi-inductive definitions. • It is noted that ...
متن کاملProofs, Programs and Abstract Complexity
Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being first order Peano arithmetic. Foundational questions asked about axiom systems comprise analysing their provable consequences, describing their class of provable recursive functions (i.e. for which programs can termination be proven from the axioms), and characterising their consistency strength. One b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013